effect din keyword search method heterogen data sourc sequel queri complet pattern mine multi dcolumn structur data direct mine discrimin pattern classifi uncertain data find rank compact connect tree effect keyword proxim search xml document coverag ddriven constraint random dbase function verif method pipelin unit structur dawar index keyword search databas cluster recommend base multi dgranular trust model network effici itemset gener discoveri stream slide window cluster recommend base multi dgranular trust model network fogger algorithm graph gener discoveri progress keyword search relat databas grape graph dbase framework disambigu peopl appear web search improv popul migrat algorithm predict protein fold frequent pattern mine uncertain data parallel commun detect larg network propinqu dynam bird stone graph dbase framework disambigu tag peopl name web search sequenti pattern larg databas custom transact transact consist custom id transact time item bought transact introduc problem mine sequenti pattern databas present algorithm solv problem empir evalu perform synthet data propos algorithm apriorisom apriorial compar perform albeit apriorisom perform minimum number custom support sequenti pattern low scale experi show apriorisom apriorial scale linearli number custom transact excel scale properti respect number transact custom number item transact introduct databas mine motiv decis support problem face larg retail organ progress bar code technolog made po contour effici algorithm discov discrimin subsequ increment sequenc dbase frequent queri pattern mine xml queri compar star approxim graph edit distanc graph data ubiquit manipul base similar essenti applic graph edit distanc wide accept measur determin similar graph extens applic field pattern recognit comput vision problem graph edit distanc comput np hard gener paper introduc method comput upper lower bound edit distanc graph polynomi time appli method algorithm appful appsub introduc perform kind graph search graph databas comprehens experiment studi conduct real synthet dataset examin aspect method bound graph edit distanc result show method achiev good scalabl term number graph size graph effect algorithm confirm us bound filter search graph compar star approxim graph edit distanc graph data ubiquit manipul base similar essenti applic graph edit distanc wide accept measur determin similar graph extens applic field pattern recognit comput vision problem graph edit distanc comput np hard gener paper introduc method comput upper lower bound edit distanc graph polynomi time appli method algorithm appful appsub introduc perform kind graph search graph databas comprehens experiment studi conduct real synthet dataset examin aspect method bound graph edit distanc result show method achiev good scalabl term number graph size graph effect algorithm confirm us bound filter search graph high confid fragment dbase classif rule mine imbalanc hiv data ghost effect graph dbase framework distinct parallel mine close quasi dcliqu effici mine minim distinguish subgraph pattern graph databas effici mine close subsequ gap constraint eas effect din keyword search method unstructur convent keyword search engin restrict data model easili adapt unstructur semistructur structur data paper propos effici adapt keyword search method call eas index queri larg collect heterogen data achiev high effici process keyword queri model unstructur semi structur structur data graph summar graph construct graph indic tradit invert indic propos extend invert index facilit keyword base search present rank mechan enhanc search effect conduct extens experiment studi real dataset result show eas achiev high search effici high accuraci outperform exist approach significantli effici vectori oper process xml twig queri race find rank compact connect tree keyword proxim search xml document effici mine frequent sequenc gener sailer effect search engin unifi retriev heterogen xml web document effect versatil keyword search engin heterogen data sourc present eas effect versatil keyword search engin enabl user easili access heterogen data compos unstructur semi structur structur data learn xpath xqueri sql languag eas address challeng keyword search neglect literatur effici adapt process keyword queri heterogen data provid capabl eas model unstructur semi structur structur data graph summar graph construct graph indic tradit invert indic effect keyword search eas adopt extend invert index facilit keyword base search emploi rank mechan enhanc search effect effect keyword search valuabl lca xml document xproj framework project structur cluster xml document xml popular method data represent web databas recent year reason popular xml abil encod structur inform data record structur characterist data set make challeng problem varieti data mine problem problem cluster structur aspect data result high implicit dimension data represent result difficult cluster data meaning paper propos effect cluster algorithm xml data substructur document order gain insight import underli structur propos wai multipl structur inform xml document evalu qualiti intermedi cluster solut guid algorithm final solut reflect true structur behavior individu partit test algorithm varieti real synthet data set research author tsinghua univers discrimin subsequ discoveri sequenc cluster dof dcore coher close quasi dcliqu mine larg dens graph databas frequent close sequenc mine candid mainten previou studi present convinc argument frequent pattern mine algorithm mine frequent pattern close lead compact complet result set effici previous develop close pattern mine algorithm work candid mainten andtest paradigm inher costli runtim space usag support threshold low pattern long paper present bide effici algorithm mine frequent close sequenc candid mainten adopt sequenc closur check scheme call bi direct extens prune search space deepli compar previou algorithm backscan prune method perform studi spars dens real synthet data set demonstr bide significantli outperform previou algorithm consum order magnitud memori order magnitud faster linearli scalabl term databas size clan algorithm mine close cliqu larg dens graph databas effici mine frequent close xml queri pattern exploit sequenc acceler xml twig queri answer clan algorithm mine close cliqu larg dens graph databas mine complex time dseri data learn markovian model increment mine frequent queri pattern xml queri cach coher close quasi dcliqu discoveri larg dens graph databas frequent coher subgraphscan provid valuabl knowledg underli intern structur graph databas mine frequent occur coher subgraph larg dens graph databasesha wit applic receiv consider attent graph mine commun recent paper studi effici mine complet set coher close quasi cliqu larg dens graph databas challeng task due downward closur properti longer hold fulli explor properti quasicliqu propos optim techniqu prune unpromis redund search space effect devis effici closur check scheme facilit discoveri close quasi cliqu develop coher close quasi cliqu mine algorithm cocain perform studi show cocain effici scalabl larg dens graph databas exploit sequenc acceler hot xml queri pattern mine microarrai analysi distinguish differenti gene express pattern larg small coloni thymidin kinas mutant mous lymphoma cell discov frequent close partial order string abstract mine knowledg order sequenc data import problem applic bioinformat web mine network manag intrus detect custom follow partial order purchas seri product partial order predict relat custom futur purchas develop market campaign biolog sequenc microarrai data cluster base partial order share sequenc set item total order subset item repres string string databas multiset string paper identifi problem mine frequent close partial order string frequent close partial order captur nonredund interest order inform string databas importantli mine frequent close partial order discov meaning knowledg disclos previou data mine techniqu problem mine frequent close partial order challeng tackl problem develop frecpo frequent close partial order practic effici algorithm mine complet set frequent close partial order larg string databas interest prune techniqu devis speed search report extens perform studi real data set synthet data set illustr effect effici approach index term frequent pattern close pattern partial order string data mine mine instanc dcentric classif rule regress cube lossless compress aggreg abstract olap engin wide support multidimension data analysi desir support data cube advanc statist measur regress filter addit tradit simpl measur count averag measur user model smooth predict trend pattern data exist algorithm simpl distribut algebra measur inadequ effici comput statist measur multidimension space paper propos fundament class measur compress measur order support effici comput statist model compress measur compress cell auxiliari matrix size independ number tupl comput statist measur data cell compress data lower level cell access raw data time space effici lossless aggreg formula deriv regress filter measur analyt experiment studi show result system regress cube substanti reduc memori usag respons time statist analysi multidimension data index term aggreg compress data cube olap framework ddemand classif evolv data stream close constrain gradient mine retail databas effici summar categor databas frequent itemset mine initi propos studi extens context associ rule mine recent year studi extend applic transact document cluster frequent itemset base cluster algorithm mine larg intermedi set frequent itemset order identifi subset promis cluster paper studi directli find subset high qualiti frequent itemset concis summari transact databas cluster categor data explor kei properti subset itemset interest propos search space prune method design effici algorithm call summari empir result show summari run fast minimum support extrem low scale respect databas size surprisingli pure frequent itemset mine algorithm effect cluster categor data effici mine frequent close partial order harmoni effici mine rule classif studi shown rule base classif algorithm perform classifi categor spars high dimension databas fundament limit rule base classifi find classif rule coarsegrain manner heurist method prune search space select rule base sequenti databas cover paradigm mine rule global rule instanc train databas make wors algorithm fail fulli exploit effect search space prune method order scale larg databas paper propos classifi har moni directli mine final set classif rule harmoni instanc centric rulegener approach sens assur train instanc highest confid rule cover instanc includ result set help lot achiev high classif accuraci introduc search strategi prune method tradit frequent itemset mine framework harmoni high effici good scalabl perform studi larg text categor databas shown harmoni outperform classifi term accuraci effici scale databas size high dimension project cluster data stream stream cube architectur multi ddimension analysi data stream tfp effici algorithm mine top dk frequent close itemset abstract frequent itemset mine studi extens literatur previou studi requir specif min support threshold aim mine complet set frequent itemset satisfi min support practic difficult user provid min support threshold addit complet set frequent itemset compact set frequent close itemset paper propos altern mine task mine top frequent close itemset length min desir number frequent close itemset mine min minim length itemset effici algorithm call tfp develop mine itemset min support start min support make length constraint properti top frequent close itemset min support rais effect fp tree prune dynam construct tree propos method close node count descend sum mine speed emploi top bottom combin fp tree travers strategi set search space prune method fast level hash index result tree close itemset verif scheme extens perform studi show tfp high perform linear scalabl term databas size index term data mine frequent itemset associ rule mine method algorithm bide effici mine frequent close sequenc previou studi present convinc argument frequent pattern mine algorithm mine frequent pattern close lead compact complet result set effici previous develop close pattern mine algorithm work candid mainten test paradigm inher costli runtim space usag support threshold low pattern long summari effici summar transact cluster frequent itemset mine initi propos studi extens context associ rule mine recent year studi extend applic transact document classif cluster frequent itemset base cluster algorithm mine larg intermedi set frequent itemset order identifi subset promis cluster paper studi directli find subset high qualiti frequent itemset concis summari transact databas cluster categor data explor properti subset itemset interest propos search space prune method design cient algorithm call summari empir result shown summari run fast minimum support extrem low scale respect databas size surprisingli pure frequent itemset mine algorithm ectiv cluster categor data summar dens transact databas demand classif data stream current model classif problem ectiv handl burst class come time fact current model classif problem simpli concentr method pass classif model larg data set model data stream classif view data stream classif problem point view dynam approach simultan train test stream dynam classif data set model reflect real life situat ectiv desir classifi test stream real time evolv train test stream aim creat classif system train model adapt quickli underli data stream order achiev goal propos demand classif process dynam select window past train data build classifi empir result system maintain high classif accuraci evolv data stream provid cient solut classif task bamboo acceler close itemset mine deepli push length ddecreas support constraint previou studi shown mine frequent pattern length decreas support constraint help remov uninterest pattern base observ short pattern tend interest high support long pattern interest support low larg number close redund pattern filter simpli appli lengthdecreas support constraint result desir pattern discoveri task mine close pattern length decreas support constraint paper studi framework project cluster high dimension data stream data stream problem studi extens recent year great eas collect stream data natur stream data make essenti algorithm requir pass data recent singl scan stream analysi method propos context mine sequenti pattern pattern dgrowth prefixspan approach sequenti pattern mine import data mine problem broad applic difficult problem mine gener examin combinatori explos number intermedi subsequ previous develop sequenti pattern mine method gsp explor candid gener test approach reduc number candid examin approach effici mine larg sequenc databas numer pattern long pattern paper propos project base sequenti pattern growth approach effici mine sequenti pattern approach sequenc databas recurs project set smaller project databas sequenti pattern grown project databas explor local frequent fragment base initi studi pattern growth base sequenti pattern mine freespan propos effici method call psp offer order growth reduc project databas improv perform pseudoproject techniqu develop prefixspan comprehens perform studi show prefixspan case outperform priori base algorithm gsp freespan spade sequenti pattern mine algorithm adopt vertic data format prefixspan integr pseudoproject fastest test algorithm mine methodolog extend mine sequenti pattern user constraint high promis pattern growth approach lead extens effici mine kind frequent pattern frequent substructur closet search strategi mine frequent close itemset mine frequent close itemset complet nonredund result frequent pattern analysi extens studi propos strategi effici frequent close itemset mine depth search breadthfirst search vertic format horizont format treestructur data structur top bottomup travers pseudo project physic project condit databas time pro con strategi pick integr strategi achiev higher perform gener case studi answer question systemat studi search strategi develop win algorithm closet closet integr advantag previous propos effect strategi newli develop perform studi synthet real data set shown advantag strategi improv closet exist mine algorithm includ closet charm op term runtim memori usag scalabl framework cluster evolv data stream cluster problem difficult problem data stream domain larg volum data arriv stream render tradit algorithm ineffici recent year onlin analyt process stream data feasibl real time surveil system dynam environ ment gener tremend potenti infinit vol um stream data volum huge scan multipl time data resid low level abstract analyst interest dynam trend outlier high level abstract discov high level characterist perform line multi level analysi stream data similar olap line analyt process relat data warehous data mine top dk frequent close pattern minimum support paper propos mine task mine top frequent close pattern length min desir number frequent close pattern mine min minim length pattern effici algorithm call tfp develop mine pattern minimum support method close node count descend sum propos effect rais support threshold prune fp tree construct fp tree mine process top bottom combin fp tree mine strategi develop speed support rais close frequent pattern discov addit fast hash base close pattern verif scheme emploi check effici potenti close pattern close cubeexplor onlin explor data cube multi ddimension regress analysi time dseri data stream real time product system dynam environ gener tremend potenti infinit amount stream data volum data huge store disk scan multipl time perform line multi dimension analysi data mine data alert peopl dramat situat initi time high qualiti respons challeng task paper cluster file system case studi paper combin good properti load balanc architectur design evalu effici web dcrawl system paper present architectur design evalu result effici web crawl system design involv fulli distribut architectur url alloc algorithm method assur system scalabl dynam reconfigur simul experi show load balanc scalabl effici achiev system distribut web crawl subsystem successfulli integr webgath chines english web search engin aim collect web page china keep pace rapid growth chines web inform addit design context digit librari architectur design evalu effici web dcrawl system paper present architectur design evalu result effici web crawl system design involv fulli distribut architectur url alloc algorithm method assur system scalabl dynam reconfigur simul experi show load balanc scalabl effici achiev system distribut web crawl subsystem successfulli integr webgath chines english web search engin aim collect web page china keep pace rapid growth chines web inform addit design context digit librari improv relev rank webgath cooper cach manag fs fs descend ncic cosmo file system prototyp singl imag cluster file system good scalabl main design goal reduc client server commun number disk access critic scalabl cooper cach reduc number network hop disk access consider network maintain cach coher paper introduc design dual granular cooper cach coher method reduc server end load network commun experi show dual granular approach greater improv compar tradit singlegranular keyword fs dual granular cach coher enhanc chanc algorithm introduct fs descend cosmo prototyp singl imag cluster file system design ncic dawn superserv design goal good scalabl reduc client server commun architectu implic na mg ft parallel benchmark 